Optimal Packet Loss Protection of Progressively Compressed 3-D Meshes
نویسندگان
چکیده
منابع مشابه
An Unequal Error Protection Method for Packet Loss Resilient 3-D Mesh Transmission
In this paper, a packet-loss resilient, bandwidth-scalable 3-D graphics streaming system is proposed. It uses the Compressed Progressive Mesh (CPM) algorithm [1] to generate a hierarchical bit-stream to represent different levels of details (LODs). We assign forward error correction (FEC) codes to each layer in the encoded bit-stream according to its importance. To this end, we develop a new di...
متن کاملA joint source and channel coding approach for progressively compressed 3-D mesh transmission
In this paper, we present an unequal error protection (UEP) method for packet-loss resilient transmission of progressively compressed 3-D meshes. The proposed method is based on a source and channel coding approach where we set up a theoretical framework for the overall system by which the channel packet loss behavior and the channel bandwidth can be directly related to the decoded mesh quality...
متن کاملOptimal protection assignment for scalable compressed images
This paper is concerned with the efficient transmission of scalable compressed images over lossy communication channels. Recent works have proposed several strategies for assigning optimal code-rates to elements in a scalable data stream, under the assumption that all elements are encoded onto a common group of network packets. When the size of the data to be encoded becomes large in comparison...
متن کاملCompressed domain packet loss concealment of sinusoidally coded speech
In this paper we consider the problem of packet loss concealment for Voice over IP (VoIP). The speech signal is compressed at the transmitter using a sinusoidal coding scheme working at 8 kbit/s. At the receiver, packet loss concealment is carried out working directly on the quantized sinusoidal parameters, based on time-scaling of the packets surrounding the missing ones. Subjective listening ...
متن کاملOptimal Oblivious Routing On D-Dimensional Meshes
In this work we consider deterministic oblivious k-k routing algorithms with buffer size O(k). Our main focus lie is the design of algorithms for dimensional n n meshes, d> 1. For these networks we present asymptotically optimal O(kpnd) step oblivious k-k routing algorithms for all k and d > 1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Multimedia
سال: 2009
ISSN: 1520-9210,1941-0077
DOI: 10.1109/tmm.2009.2030546